Multiplicities of Integer Arrays
نویسنده
چکیده
We prove a general theorem about the multiplicity of the entries in certain integer arrays which is best possible in general. As an application we give non-trivial bounds for the multiplicities of several well-known combinatorial arrays including the binomial coefficients, Narayana numbers and the Eulerian numbers. For the binomial coefficients we obtain the result of Singmaster.
منابع مشابه
2 00 1 su ( N ) tensor product multiplicities and virtual Berenstein - Zelevinsky triangles
Information on su(N) tensor product multiplicities is neatly encoded in Berenstein-Zelevinsky triangles. Here we study a generalisation of these triangles by allowing negative as well as non-negative integer entries. For a fixed triple product of weights, these generalised Berenstein-Zelevinsky triangles span a lattice in which one may move by adding integer linear combinations of so-called vir...
متن کامل0 su ( N ) tensor product multiplicities and virtual Berenstein - Zelevinsky triangles
Information on su(N) tensor product multiplicities is neatly encoded in Berenstein-Zelevinsky triangles. Here we study a generalisation of these triangles by allowing negative as well as positive integer entries. For a fixed triple product of weights, these generalised Berenstein-Zelevinsky triangles span a lattice in which one may move by adding integer linear combinations of so-called virtual...
متن کامل51 v 2 1 3 Fe b 20 01 su ( N ) tensor product multiplicities and virtual Berenstein - Zelevinsky triangles
Information on su(N) tensor product multiplicities is neatly encoded in Berenstein-Zelevinsky triangles. Here we study a generalisation of these triangles by allowing negative as well as positive integer entries. For a fixed triple product of weights, these generalised Berenstein-Zelevinsky triangles span a lattice in which one may move by adding integer linear combinations of so-called virtual...
متن کاملPartitions according to multiplicities and part sizes
In this paper we study the largest parts in integer partitions according to multiplicities and part sizes. Firstly we investigate various properties of the multiplicities of the largest parts. We then consider the sum of the m largest parts first as distinct parts and then including multiplicities. Finally, we find the generating function for the sum of the m largest parts of a partition, i.e.,...
متن کاملSamples of geometric random variables with multiplicity constraints
We investigate the probability that a sample Γ = (Γ1,Γ2, . . . ,Γn) of independent, identically distributed random variables with a geometric distribution has no elements occurring exactly j times, where j belongs to a specified finite ‘forbidden set’ A of multiplicities. Specific choices of the set A enable one to determine the asymptotic probabilities that such a sample has no variable occuri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010